Lowness Properties and Approximations of the Jump

نویسندگان

  • Santiago Figueira
  • André Nies
  • Frank Stephan
چکیده

We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-lowness for sets of natural numbers. A computable non-decreasing unbounded function h is called an order function. Informally, a set A is strongly jumptraceable if for each order function h, for each input e one may effectively enumerate a set Te of possible values for the jump JA(e), and the number of values enumerated is at most h(e). A′ is well-approximable if can be effectively approximated with less than h(x) changes at input x, for each order function h. We prove that there is a strongly jump-traceable set which is not computable, and that if A′ is well-approximable then A is strongly jump-traceable. For r.e. sets, the converse holds as well. We characterize jump-traceability and the corresponding strong variant in terms of Kolmogorov complexity, and we investigate other properties of these lowness notions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reals which Compute Little André

We investigate combinatorial lowness properties of sets of natural numbers (reals). The real A is super-low if A′ ≤tt ∅′, and A is jump-traceable if the values of {e}A(e) can be effectively approximated in a sense to be specified. We investigate those properties, in particular showing that super-lowness and jump-traceability coincide within the r.e. sets but none of the properties implies the o...

متن کامل

Reals which compute little

We investigate combinatorial lowness properties of sets of natural numbers (reals). The real A is super-low if A′ ≤tt ∅′, and A is jump-traceable if the values of {e}A(e) can be effectively approximated in a sense to be specified. We investigate those properties, in particular showing that super-lowness and jump-traceability coincide within the r.e. sets but none of the properties implies the o...

متن کامل

Bounded Limit Recursiveness

Let X be a Turing oracle. A function f(n) is said to be boundedly limit recursive in X if it is the limit of an X-recursive sequence of X-recursive functions f̃(n, s) such that the number of times f̃(n, s) changes is bounded by a recursive function of n. Let us say that X is BLR-low if every function which is boundedly limit recursive in X is boundedly limit recursive in 0. This is a lowness prop...

متن کامل

Benign cost functions and lowness properties

We show that the class of strongly jump-traceable c.e. sets can be characterised as those which have sufficiently slow enumerations so they obey a class of well-behaved cost function, called benign. This characterisation implies the containment of the class of strongly jump-traceable c.e. Turing degrees in a number of lowness classes, in particular the classes of the degrees which lie below inc...

متن کامل

Lowness for Difference Tests

We show that being low for difference tests is the same as being computable and therefore lowness for difference tests is not the same as lowness for difference randomness. This is the first known example of a randomness notion where lowness for the randomness notion and lowness for the test notion do not coincide. Additionally, we show that for every incomputable set A, there is a difference t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 152  شماره 

صفحات  -

تاریخ انتشار 2006